P-subgraph Isomorphism Computation and Upper Bound Complexity Estimation
نویسنده
چکیده
An approach for subgraph isomorphism computation of parameter-ized graphs will be presented. Parameterized graphs (short: p-graphs) are extensions of undirected graphs by parameter vectors at the nodes and edges. We will deene p-graphs and basic concepts of subgraph isomorphism computation for p-graphs. A bottom-up algorithm for p-subgraph isomorphism computation according to a given search graph and a template graph will be described. Since the enumeration of all induced p-subgraphs require tremendous eeort, we will propose three pruning mechanisms in order to reduce the size of the search space. Finally, we will estimate an upper bound complexity of the algorithm.
منابع مشابه
Recognition of Polymorphic Patterns in Parameterized Graphs for 3d Building Reconstruction
An approach for the recognition of polymorphic patterns by subgraph isomorphism computation of parameterized graphs will be presented. Parameterized graphs (short: p-graphs) are extensions of undirected graphs by parameter vectors at the nodes and edges. We will deene p-graphs and basic concepts of subgraph isomor-phism computation for p-graphs. A bottom-up algorithm for p-subgraph isomorphism ...
متن کاملQuantum Query Complexity of Subgraph Isomorphism and Homomorphism
Let H be a fixed graph on n vertices. Let fH(G) = 1 iff the input graph G on n vertices contains H as a (not necessarily induced) subgraph. Let αH denote the cardinality of a maximum independent set of H. In this paper we show: Q(fH) = Ω ( √ αH · n) , where Q(fH) denotes the quantum query complexity of fH . As a consequence we obtain a lower bounds for Q(fH) in terms of several other parameters...
متن کاملSubexponential Time Algorithms for Embedding H-Minor Free Graphs
We establish the complexity of several graph embedding problems: Subgraph Isomorphism, Graph Minor, Induced Subgraph and Induced Minor, when restricted to H-minor free graphs. In each of these problems, we are given a pattern graph P and a host graph G, and want to determine whether P is a subgraph (minor, induced subgraph or induced minor) of G. We show that, for any fixed graph H and > 0, if ...
متن کاملOn the Ac Complexity of Subgraph Isomorphism∗
Let P be a fixed graph (hereafter called a “pattern”), and let Subgraph(P ) denote the problem of deciding whether a given graph G contains a subgraph isomorphic to P . We are interested in AC0-complexity of this problem, determined by the smallest possible exponent C(P ) for which Subgraph(P ) possesses bounded-depth circuits of size nC(P )+o(1). Motivated by the previous research in the area,...
متن کاملSome Results in Circuit Complexity
The thesis consists of three parts. The first part investigates the AC complexity of subgraph isomorphism problem that is, detecting whether an n-vertex input graph contains a P -subgraph for some fixed P . For the average-case complexity, where the input is a distribution on random graphs at the threshold and small error is allowed, we are able to explicitly characterize the minimal AC size up...
متن کامل